W-convexity on the Isbell-convex hull of an asymmetrically normed real vector space
نویسندگان
چکیده
K?nzi and Yilzid introduced the concept of convexity structures in sense Takahashi quasi-pseudometric spaces [7]. In this article, we continue study theory, introducing W-convexity for real-valued pair functions defined on an asymmetrically normed real vector space. Moreover, show that all minimal pairs space equipped with a convex structure which is W-convex whenever W translation-invariant.
منابع مشابه
Menger probabilistic normed space is a category topological vector space
In this paper, we formalize the Menger probabilistic normed space as a category in which its objects are the Menger probabilistic normed spaces and its morphisms are fuzzy continuous operators. Then, we show that the category of probabilistic normed spaces is isomorphicly a subcategory of the category of topological vector spaces. So, we can easily apply the results of topological vector spaces...
متن کاملON THE CONVEX HULL GENUS OF SPACE CURVES-t
LET K C R3 be a simple closed curve, and K be its convex hull. In [l], Almgren and Thurston define the (oriented) convex hull genus of K to be the minimal genus of an (oriented) surface contained in g and bounded by K. They give examples showing that even if K is unknotted both the orientable and non-orientable convex hull genus of K may be arbitrarily large. In 43 of this paper we show that th...
متن کاملOn the convex hull of a space curve
The boundary of the convex hull of a compact algebraic curve in real 3-space defines a real algebraic surface. For general curves, that boundary surface is reducible, consisting of tritangent planes and a scroll of stationary bisecants. We express the degree of this surface in terms of the degree, genus and singularities of the curve. We present algorithms for computing their defining polynomia...
متن کاملSpace-efficient planar convex hull algorithms
A space-efficient algorithm is one in which the output is given in the same location as the input and only a small amount of additional memory is used by the algorithm. We describe four space-efficient algorithms for computing the convex hull of a planar point set.
متن کاملOn Integrated Convex Optimization in Normed Linear Space
Abstract In this paper, the concept of generalized saddle point(GSP) is employed to discuss the optimization problems of a set of convex functions on a normed linear space X , which presents an equivalence under a special condition between GSP and its optimum solution. A study on integrated convex optimization problem by using Gâteaux and Fréchet differentiability respectivly, and the equivalen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Filomat
سال: 2023
ISSN: ['2406-0933', '0354-5180']
DOI: https://doi.org/10.2298/fil2306975o